Twenty Questions for Noël Arnaud

Twenty Questions for the Midterm

1. Assume everything you know from the notes on Riemann-Stieltjes integration. (a) Show that if g : [0, 1]→ R is Riemann-integrable on [0, 1] and φ : [a, b]→ R is continuous on an interval [a, b] ⊇ g[[0, 1]], then φ ◦ g is Riemann-integrable on [0, 1]. (b) Assume that f : [0, 1]→ R is a function for which f ′(t) exists at each t ∈ [0, 1] (one-sidedly at endpoints) and that the Riemann integral ...

Twenty Questions for the Final

1. (a) Let (X, ‖ · ‖) and (Y, ‖ · ‖) be normed spaces. Show that the following conditions on a family T ⊆ L(X, Y ) are logically equivalent: (1) {‖T ‖ : T ∈ T} is bounded in R; (2) {T : T ∈ T} is equicontinuous at some point of X ; (3) {T : T ∈ T} is equicontinuous at 0 ∈ X ; (4) {T : T ∈ T} is equicontinuous at every point of X . (This order may not be the most efficient one to prove round-rob...

Twenty-five questions for string theorists

In an effort to promote communication between the formal and phenomenological branches of the high-energy theory community, we provide a description of some important issues in supersymmetric and string phenomenology. We describe each within the context of string constructions, illustrating them with specific examples where applicable. Each topic culminates in a set of questions that we believe...

Discussion of Twenty Questions Problem

Discuss several tricks for solving twenty question problems which in this paper is depicted as a guessing game. Player tries to find a ball in twenty boxes by asking as few questions as possible, and these questions are answered by only “Yes” or “No”. With the discussion, demonstration of source coding methods is the main concern.

Shape Recognition and Twenty Questions